Separation of partition inequalities with terminals
نویسندگان
چکیده
Given a graph with n nodes each of them having labels equal either to 1 or 2 (a node with label 2 is called a terminal), we consider the (1,2)-survivable network design problem and more precisely, the separation problem for the partition inequalities. We show that this separation problem reduces to a sequence of submodular flow problems. Based on an algorithm developed by Fujishige and Zhang the problem is reduced to a sequence of O(n4) minimum cut problems.
منابع مشابه
Development and Application of Aqueous Two-Phase Partition for the Recovery and Separation of Recombinant Phenylalanine Dehydrogenase
Aqueous two-phase systems (ATPS) have emerged as a powerful extraction method for the downstream processing of bio-molecules. The aim of this work was to investigate the possibility of utilizing ATPS for the separation of recombinant Bacillus sphaericus phenylalanine dehydrogenase (PheDH). Polyethylene glycol (PEG) and ammonium sulfate systems were selected for our experi...
متن کاملThe node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for cycle, cycle with ears, knapsack tr...
متن کاملPolyhedral Computations for the Simple Graph Partitioning Problem
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we present a branch-and-cut algorithm for the problem that uses several classes of facet-defining inequalities as cuttingplanes. These are b-tree, clique, cycl...
متن کاملThree-partition Inequalities for Constant Capacity Capacitated Fixed-charge Network Flow Problems
Flow cover inequalities are among the most effective valid inequalities for solving capacitated fixed-charge network flow problems. These valid inequalities are implications on the flow quantity on the cut arcs of a two-partitioning of the network, depending on whether some of the cut arcs are open or closed. As the implications are only on the cut arcs, flow cover inequalities can be modeled b...
متن کاملThree-partition flow cover inequalities for constant capacity fixed-charge network flow problems
Flow cover inequalities are among the most effective valid inequalities for capacitated fixed-charge network flow problems. These valid inequalities are based on implications for the flow quantity on the cut arcs of a two-partitioning of the network, depending on whether some of the cut arcs are open or closed. As the implications are only on the cut arcs, flow cover inequalities can be obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 1 شماره
صفحات -
تاریخ انتشار 2004